Structural Refinement for the Modal nu-Calculus
نویسندگان
چکیده
We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nucalculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two specification formalisms are structurally equivalent. To the best of our knowledge, this is the first time such a close relationship between a logical and a behavioral specification formalism has been shown. Using our translations, we also transfer the structural operations of composition and quotient from disjunctive modal transition systems to the modal nu-calculus. This shows that the modal nu-calculus supports composition and decomposition of specifications.
منابع مشابه
Modal Specifications for the Control Theory of Discrete Event Systems
2 Conjunctive Nu-calculus and Modal Specifications 4 2.1 The Conjunctive Nu-calculus . . . . . . . . . . . . . . . . . . . 5 2.1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.2 Semantics . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Modal Specifications and Their Models . . . . . . . . . . . . . 6 2.2.1 Modal Specifications . . . . . . . . . . . . . . . . . . . ...
متن کاملLocal Abstraction-Refinement for the mu-Calculus
Counterexample-guided abstraction refinement (CEGAR) is a key technique for the verification of computer programs. Grumberg et al. developed a CEGAR-based algorithm for the modal μ-calculus. There, every abstract state is split in a refinement step. In this paper, the work of Grumberg et al. is generalized by presenting a new CEGAR-based algorithm for the μ-calculus. It is based on a more expre...
متن کاملRefinement Modal Logic
In this paper we present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only ‘atoms’ and ‘back’ need to be satisfied. Our logic contains a new operator ∀ in additional to the standard modalities 2 for each agent. The operator ∀ acts as a quantifier over the set of all refinements of a given model. We call it the refinement operato...
متن کاملA Case-Study in Timed Refinement: A Mine Pump
A specification and top-level refinement of a simple mine pump control system, as well as a proof of correctness of the refinement, are presented as an example of the application of a formal method for the development of time-based systems. The overall approach makes use of a refinement calculus for timed systems, similar to the refinement calculi for sequential programs. The specification make...
متن کاملState Focusing: Lazy Abstraction for the Mu-Calculus
A key technique for the verification of programs is counterexampleguided abstraction refinement (CEGAR). In a previous approach, we developed a CEGAR-based algorithm for the modal μ-calculus, where refinement applies only locally, i.e. lazy abstraction techniques are used. Unfortunately, our previous algorithm was not completely lazy and had some further drawbacks, like a possible local state e...
متن کامل